Bounds on Expected Project Tardiness

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tardiness Bounds under Global EDF Scheduling on a Multiprocessor

This is the review of two papers, Tardiness Bounds under Global EDF Scheduling on a Multiprocessor (RTSS’05) and An O(m) Analysis Technique for Supporting Real-Time Self-Suspending Task Systems (RTSS’12).

متن کامل

Tardiness Bounds for Global Multiprocessor Scheduling Algorithms

From 10.02. to 15.02., the Dagstuhl Seminar 08071 Scheduling was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together ...

متن کامل

Tight Bounds on Expected Order Statistics

In this paper, we study the problem of finding tight bounds on the expected value of the kth order statistic E[xk:n] under moment information on n real-valued random variables. Given means E[xi] = μi and variances V ar[xi] = σ i , we show that the tight upper bound on the expected value of the highest order statistic E[xn:n] can be computed with a bisection search algorithm. An extremal discret...

متن کامل

Exponentially Small Bounds on the Expected Optimum

In this paper we are interested in behavior of this problem when the xi are i.i.d. random variables. Under fairly general conditions, the median of the solution for the subset sum problem has been shown to be exponentially small when t is near E [∑n i=1 xi ] [Luek82]; this result has found application in the probabilistic analysis of approximation algorithms for the 0-1 Knapsack problem [Luek82...

متن کامل

Relative Expected Instantaneous Loss Bounds

In the literature a number of relative loss bounds have been shown for on-line learning algorithms. Here the relative loss is the total loss of the on-line algorithm in all trials minus the total loss of the best comparator that is chosen off-line. However, for many applications instantaneous loss bounds are more interesting where the learner first sees a batch of examples and then uses these e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1995

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.43.5.838